Robust Universal Inference

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Inference

Robust statistics deals with deviations from ideal parametric models and their dangers for the statistical procedures derived under the assumed model. Its primary goal is the development of procedures which are still reliable and reasonably efficient under small deviations from the model, i.e. when the underlying distribution lies in a neighborhood of the assumed model. Robust statistics is the...

متن کامل

Robust Potato Color Image Segmentation using Adaptive Fuzzy Inference System

Potato image segmentation is an important part of image-based potato defect detection. This paper presents a robust potato color image segmentation through a combination of a fuzzy rule based system, an image thresholding based on Genetic Algorithm (GA) optimization and morphological operators. The proposed potato color image segmentation is robust against variation of background, distance and ...

متن کامل

Robust Universal Complete

Several measures are deened and investigated, which allow the comparison of codes as to their robustness against errors. Then new universal and complete sequences of variable-length codewords are proposed , based on representing the integers in a binary Fibonacci numer-ation system. Each sequence is constant and need not be generated for every probability distribution. These codes can be used a...

متن کامل

A Robust Universal Controller

The present paper advocates the use of ODE-based (instead of algebra-based) constraints on the output variables of a controlled system, and the use of dynamic control laws (instead of static control laws)—when finite but small errors in honoring the constraints are considered acceptable. It is assumed that the sensor signals are reliable and have good signal-to-noise ratios, that the controller...

متن کامل

A Universal Inductive Inference Machine

A paradigm of scientific discovery is defined within a first-order logical framework. It is shown that within this paradigm there exists a formal scientist that is Turing computable and universal in the sense that it solves every problem that any scientist can solve. It is also shown that universal scientists exist for no regular logics that extend first order logic and satisfy the Lowenheim-Sk...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Entropy

سال: 2021

ISSN: 1099-4300

DOI: 10.3390/e23060773